2 6 Ja n 19 95 FILTER GAMES AND COMBINATORIAL PROPERTIES OF WINNING STRATEGIES
نویسنده
چکیده
We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.
منابع مشابه
A Winning Strategy for the Ramsey Graph Game
We consider a \Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games.
متن کاملAperiodic Subtraction Games
Periodicity is a fundamental property of many combinatorial games. It is sought vigorously, yet remains elusive in important cases, such as for some octal games, notably Grundy’s game. Periodicity is important, because it provides poly-time winning strategies for many games. In particular, subtraction games, impartial and partizan, have been proved to be periodic. Our main purpose here is to ex...
متن کاملLattice Point Methods for Combinatorial Games
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these lattice games can be made particularly efficient for octal games, which we generalize to squarefree games. These additionally encompass all heap games in a natural setting, in which the Sprague–Grundy theorem for normal play manifests itself geometrically...
متن کاملThe Rat game and the Mouse game
We define three new take-away games, the Rat game, the Mouse game and the Fat Rat game. Three winning strategies are given for the Rat game and outlined for the Mouse and Fat Rat games. The efficiencies of the strategies are determined. Whereas the winning strategies of nontrivial take-away games are based on irrational numbers, our games are based on rational numbers. Another motivation stems ...
متن کامل. L O ] 1 9 M ay 1 99 9 FILTERS AND GAMES
We obtain game–theoretic characterizations for meagerness and rareness of filters on ω. One of the classical methods for obtaining a set of real numbers which does not have the property of Baire, is to interpret appropriate filters on N = {1,2,3, . . . } as subsets of [0, 1]. Filters which result in a set having the property of Baire have nice combinatorial characterizations, due to Talagrand [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995